Optimal task sequencing with precedence constraints
نویسندگان
چکیده
منابع مشابه
Algorithm for One Machine Job Sequencing with Precedence Constraints
Consider the problem of sequencing n jobs with general precedence constraints on a single machine to minimize total weighted completion time, which is NP-complete. However some class of problems can be solved in polynomial time, i.e .. the problems whose precedence constraints are trees or series parallel. This paper proposes an O(n4) algorithm for implementing a decomposition procedure due to ...
متن کاملSequencing with Ordered Criteria, Precedence and Group Technology Constraints
Multicriteria sequencing problems with criteria ordered according to their importance are considered. Additional precedence and group technology constraints are imposed. We introduce a notion of a priority-generating vector function and suggest general techniques that form a base for the construction of polynomial time algorithms for numerous sequencing problems including all known polynomially...
متن کاملFinding optimal Bayesian networks using precedence constraints
We consider the problem of finding a directed acyclic graph (DAG) that optimizes a decomposable Bayesian network score. While in a favorable case an optimal DAG can be found in polynomial time, in the worst case the fastest known algorithms rely on dynamic programming across the node subsets, taking time and space 2n, to within a factor polynomial in the number of nodes n. In practice, these al...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملProcess Discovery with Precedence Constraints
The automatic discovery of a process model out of a historical log traces can be of great value for both analysis and design tasks, and is a major goal of Process Mining approaches. A key step in discovering such a model consists in detecting a graph of causal/precedence dependencies over process activities – which can be possibly used to eventually derive more expressive control-flow (e.g., Pe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1973
ISSN: 0012-365X
DOI: 10.1016/0012-365x(73)90113-1